On Recognizable Languages in Left Divisibility Monoids
نویسندگان
چکیده
We describe a class of monoids where c-rational languages can be deened analogously to trace theory and where these languages are precisely the recognizable ones. The proofs rely on Ramsey's theorem, distributive lattice theory and on Hashigushi's rank function generalized to our left divisibility monoids. We obtain Ochma nski's theorem on recognizable languages in free partially commutative monoids as a consequence.
منابع مشابه
On Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directions, including trace and rational monoids. Here, we investigate divisibility monoids which are defined by and capture algebraic properties sufficient to obtain a characterization of the recognizable languages by certain...
متن کاملDivisibility Monoids: Presentation, Word Problem, and Rational Languages
We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We give a decidable class of presentations that gives rise precisely to all divisibility monoids. (2) We show that any divisibility monoid is an automatic monoid [5]. This implies that its word problem is solvable in quadratic tim...
متن کاملStar-connected rational expressions
Star-connected rational expressions were considered only as expressions defining trace languages. In this paper we continue the study of the class of flat languages defined by this kind of rational expressions (see [5], [4]). We obtain stronger results and prove that any language is star-connected iff it is accepted by a finite automaton with cycles which are proper composition of connected cyc...
متن کاملDivisibility problem for one relator monoids
Theorem 1 The word problem for any 1-relator monoids can be reduced to the left side divisibility problem for monoids M presented in 2 generators by 1 defining relation of the form aU = bV . For the solution of this problem it sufficies to find an algorithm to recognize for any word aW (or for any word bW ) whether or not it is left side divisible in M by the letter b (accordingly by the letter...
متن کاملThe Power of Programs over Monoids in DA
The program-over-monoid model of computation originates with Barrington’s proof that it captures the complexity class NC1. Here we make progress in understanding the subtleties of the model. First, we identify a new tameness condition on a class of monoids that entails a natural characterization of the regular languages recognizable by programs over monoids from the class. Second, we prove that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998